Performance Measures for Linear Oscillator Networks Over Arbitrary Graphs
نویسندگان
چکیده
منابع مشابه
Similarity Measures over Refinement Graphs
Similarity assessment plays a key role in lazy learning methods such as knearest neighbor or case-based reasoning. In this paper we will show how refinement graphs, that were originally introduced for inductive learning, can be employed to assess and reason about similarity. We will define and analyze two similarity measures, $S_{?}$ and $S_{?}$, based on refinement graphs. The \emph{anti-unifi...
متن کاملDistributed Quadratic Programming over Arbitrary Graphs
In this paper, the locality features of infinitedimensional quadratic programming (QP) optimization problems are studied. Our approach is based on tools from operator theory and ideas from Multi Parametric Quadratic Programming (MPQP). The key idea is to use the spatially decaying operators (SD), which has been recently developed to study spatially distributed systems in [1], to capture couplin...
متن کاملSimilarity Measures over Refinement Graphs
Similarity assessment plays a key role in lazy learning methods such as knearest neighbor or case-based reasoning. In this paper we will show how refinement graphs, that were originally introduced for inductive learning, can be employed to assess and reason about similarity. We will define and analyze two similarity measures, $S_{?}$ and $S_{?}$, based on refinement graphs. The \emph{anti-unifi...
متن کاملInterdependent Security Game Design over Constrained Linear Influence Networks
In today's highly interconnected networks, security of the entities are often interdependent. This means security decisions of the agents are not only influenced by their own costs and constraints, but also are affected by their neighbors’ decisions. Game theory provides a rich set of tools to analyze such influence networks. In the game model, players try to maximize their utilities through se...
متن کاملBalloon Types for Safe Parallelisation over Arbitrary Object Graphs
Safe parallelisation of object-oriented programs requires static guarantees about the shape and/or intended usage of reachable objects. For example, transitively immutable objects lend themselves naturally to concurrent access. However, parallelising tasks which potentially mutate reachable objects is more challenging. One approach to avoiding race conditions is to ensure the reachable object g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control of Network Systems
سال: 2018
ISSN: 2325-5870
DOI: 10.1109/tcns.2016.2619900